Strong KKT conditions and weak sharp solutions in convex-composite optimization

نویسندگان

  • Xi Yin Zheng
  • Kung Fu Ng
چکیده

Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the classical KKT conditions. These notions are shown to be closely related to the notions of sharp or weak sharp solutions. As applications, we extend some results on metric regularity of inequalities from the convex case to the convex-composite case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings

The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...

متن کامل

Lecture 12 : KKT conditions

The Lagrange dual function is: g(u, v) = min x L(x, u, v) The corresponding dual problem is: maxu,v g(u, v) subject to u ≥ 0 The Lagrange dual function can be viewd as a pointwise maximization of some affine functions so it is always concave. The dual problem is always convex even if the primal problem is not convex. For any primal problem and dual problem, the weak duality always holds: f∗ ≥ g...

متن کامل

On the duality of quadratic minimization problems using pseudo inverses

‎In this paper we consider the minimization of a positive semidefinite quadratic form‎, ‎having a singular corresponding matrix $H$‎. ‎We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method‎. ‎Given this approach and based on t...

متن کامل

Finite Dimensional Optimization Part I: The KKT Theorem1

These notes characterize maxima and minima in terms of first derivatives. I focus primarily on maximization. The problem of minimizing a function f has the same solution (or solutions) as the problem of maximizing −f , so all of the results for maximization have easy corollaries for minimization. The main result of these notes is the Karush-Kuhn-Tucker (KKT) Theorem, recorded as Theorem 3 in Se...

متن کامل

A Gauss - Newton method for convex composite optimization 1

An extension of the Gauss-Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h o F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) E C. This result extends a similar convergence result due to Womersley (this journa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 126  شماره 

صفحات  -

تاریخ انتشار 2011